An empirical evaluation of performance-memory trade-offs in time warp
نویسندگان
چکیده
منابع مشابه
An Empirical Evaluation of Performance-Memory Trade-Offs in Time Warp
The performance of the Time Warp mechanism is experimentally evaluated when only a limited amount of memory is available to the parallel computation. An implementation of the cancelback protocol is used for memory management on a shared memory architecture, viz., KSR to evaluate the performance vs. memory tradeoff. The implementation of the cancelback protocol supports canceling back more than ...
متن کاملAn Empirical Evaluation ofPerformance - Memory Trade - o s in Time Warp
We experimentally evaluate the performance of the Time Warp mechanism when only a limited amount of memory is available to the parallel computation. To this end we use an implementation of the cancelback protocol for memory management on a shared memory architecture , viz., KSR to evaluate the performance vs. memory tradeoo. Our implementation of the cancelback protocol supports canceling back ...
متن کاملTime - Memory - Processor Trade - offs HAMID
-It is demonstrated that usual time-memory trade-offs offer no asymptotic advantage over exhaustive search. Instead, trade-offs between time, memory, and parallel processing are proposed. Using this approach it is shown that most searching problems allow a trade-off between C,, the cost per solution, and C,,,, the cost of the machine: doubling C,,, increases the solution rate by a factor of fou...
متن کاملTime-Memory Trade-Offs for Near-Collisions
In this work we consider generic algorithms to find nearcollisions for a hash function. If we consider only hash computations, it is easy to compute a lower-bound for the complexity of near-collision algorithms, and to build a matching algorithm. However, this algorithm needs a lot of memory, and makes more than 2 memory accesses. Recently, several algorithms have been proposed without this mem...
متن کاملTime-memory trade-offs for index calculus in genus 3
In this paper, we present a variant of Diem’s Õ(q) index calculus algorithm to attack the discrete logarithm problem (DLP) in Jacobians of genus 3 non-hyperelliptic curves over a finite field Fq. We implement this new variant in C++ and study the complexity in both theory and practice, making the logarithmic factors and constants hidden in the Õ-notation precise. Our variant improves the comput...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Transactions on Parallel and Distributed Systems
سال: 1997
ISSN: 1045-9219
DOI: 10.1109/71.577269